SOAP vs REST: Comparing a master-slave GA implementation
نویسندگان
چکیده
— In this paper, a high-level comparison of both SOAP (Simple Object Access Protocol) and REST (Repre-sentational State Transfer) is made. These are the two main approaches for interfacing to the web with web services. Both approaches are different and present some advantages and disadvantages for interfacing to web services: SOAP is conceptually more difficult (has a steeper learning curve) and more " heavyweight " than REST, although it lacks of standards support for security. In order to test their eficiency (in time), two experiments have been performed using both technologies: a client-server model implementation and a master-slave based genetic algorithm (GA). The results obtained show clear differences in time between SOAP and REST implementations. Although both techniques are suitable for developing parallel systems, SOAP is heavier than REST, mainly due to the verbosity of SOAP communications (XML increases the time taken to parse the messages).
منابع مشابه
Solving Signal Coordination Problems Using Master- Slave Genetic Algorithms
This paper presents the design of master-slave genetic algorithms (GA) in solving signal coordination problems. When a serial GA is applied, its performance in terms of computation time diminishes as more accurate results (smaller time slices to evaluate flows and queues) of network performances are needed, or the size of signal networks increases. Because GA works with a population of independ...
متن کاملExtended Distributed Genetic Algorithm for Channel Routing
In this paper, we propose a new parallel genetic a lge rithm (GA), called Extended Distributed Genetic Algorithm (EDGA), for channel routing problem. The EDGA combines the advantages of previous parallel GA models , viz., master/slave GA model and distributed GA model. In EDGA, the root processor executes the conventional genetic algorithm with global selection on total population and the remai...
متن کاملTowards Formally Defining and Verifying Master/Slave Speculative Parallelization
Master/Slave Speculative Parallelization (MSSP) is a new paradigm aiming at decoupling performance and correctness in microprocessor design and implementation. It is based on the idea that a speculative master processor splits the code and distributes tasks to independent slave processors, which can commit their results only under specific conditions. This work reports the first steps in our ef...
متن کاملMaster/slave Speculative Parallelization and Approximate Code
This dissertation describes Master/Slave Speculative Parallelization (MSSP), a novel execution paradigm to improve the execution rate of sequential programs by parallelizing them speculatively for execution on a multiprocessor. In MSSP, one processor—the master—executes an approximate copy of the program to compute values the program’s execution is expected to compute. The master’s results are ...
متن کاملClustering-based hierarchical genetic algorithm for complex fitness landscapes
We propose the use of a hierarchical Genetic Algorithm (GA) for optimization in complex landscapes. While the slave GA tries to find local optima in the restricted fitness landscape of low complexity, the master GA tries to identify interesting regions in the entire landscape. The slave GA is a conventional GA with high convergence. The master GA is more exploratory in nature. This GA clusters ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1105.4978 شماره
صفحات -
تاریخ انتشار 2011